On r-th Root Extraction Algorithm in Fq For q≡lrs+1 (mod rs+1) with 0 < l < r and Small s
نویسندگان
چکیده
We present an r-th root extraction algorithm over a finite field Fq. Our algorithm precomputes a primitive r-th root of unity ξ where s is the largest positive integer satisfying r|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms.
منابع مشابه
Square Root Algorithm in F q for q ≡ 2 s + 1 ( mod 2 s + 1 ) Namhun Koo ,
We present a square root algorithm in Fq which generalizes Atkins’s square root algorithm [6] for q ≡ 5 (mod 8) and Kong et al.’s algorithm [8] for q ≡ 9 (mod 16). Our algorithm precomputes a primitive 2-th root of unity ξ where s is the largest positive integer satisfying 2|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square roo...
متن کاملNew Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field
We present a new cube root algorithm in finite field Fq with q a power of prime, which extends Cipolla-Lehmer type algorithms and has lower complexity than Tonelli-Shanks type algorithms. Efficient computation of r-th root in Fq has many applications in computational number theory and many other related areas. There are two standard algorithms for computing rth root in finite field. One is Adle...
متن کاملJacobi sums and new families of irreducible polynomials of Gaussian periods
Let m > 2, ζm an m-th primitive root of 1, q ≡ 1 mod 2m a prime number, s = sq a primitive root modulo q and f = fq = (q − 1)/m. We study the Jacobi sums Ja,b = − ∑q−1 k=2 ζ a inds(k)+b inds(1−k) m , 0 ≤ a, b ≤ m−1, where inds(k) is the least nonnegative integer such that s inds(k) ≡ k mod q. We exhibit a set of properties that characterize these sums, some congruences they satisfy, and a MAPLE...
متن کاملOn the construction of small subsets containing special elements in a finite field
In this note we construct a series of small subsets containing a nond-th power element in a finite field by applying certain bounds on incomplete character sums. Precisely, let h = ⌊qδ⌋ > 1 and d | qh − 1. Let r be a prime divisor of q− 1 such that the largest prime power part of q − 1 has the form rs. Then there is a constant 0 < ǫ < 1 such that for a ratio at least q−ǫh of α ∈ Fqh\Fq, the set...
متن کاملAn Improvement of the Cipolla-Lehmer Type Algorithms
Let Fq be a finite field with q elements with prime power q and let r > 1 be an integer with q ≡ 1 (mod r). In this paper, we present a refinement of the Cipolla-Lehmer type algorithm given by H. C. Williams, and subsequently improved by K. S. Williams and K. Hardy. For a given r-th power residue c ∈ Fq where r is an odd prime, the algorithm of H. C. Williams determines a solution of X = c in O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 65 شماره
صفحات -
تاریخ انتشار 2013